Applying General Access Structure to Metering Schemes

In order to decide on advertisement fees for web servers, Naor and Pinkas [15] introduced metering schemes secure against coalition of corrupt servers and clients. In their schemes any server is able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number of clients. After that in series of papers Masucci et. al. [1–3, 13, 14] generalized the idea of Naor and Pinkas proposing first metering scheme with pricing and dynamic multithreshold metering schemes and later applying general access structures and a linear algebraic approach to metering schemes. In this paper we are interested in the efficiency of applying general access structure and linear algebraic approach to metering schemes. We propose a new model considering general access structures for clients, corrupted clients and servers. Then we bind the access structures for clients and corrupted clients into one. We propose a new metering scheme, which is more efficient on the communication complexity and memory storage compared with the scheme proposed in [3].